Learning Meets Verification

نویسنده

  • Martin Leucker
چکیده

In this paper, we give an overview on some algorithms for learning automata. Starting with Biermann’s and Angluin’s algorithms, we describe some of the extensions catering for specialized or richer classes of automata. Furthermore, we survey their recent application to verification problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Application of Reinforcement learning algorithms to software verification

This thesis presents a novel form of system verification through reinforcement learning algorithms. Large and complex software systems are often developed as a team effort. The aim of the development is to satisfy the customer by delivering the right product, with the right quality, and in time. Errors made by developers will always occur when a system is developed, but their effect can be redu...

متن کامل

Use of the Shearlet Transform and Transfer Learning in Offline Handwritten Signature Verification and Recognition

Despite the growing growth of technology, handwritten signature has been selected as the first option between biometrics by users. In this paper, a new methodology for offline handwritten signature verification and recognition based on the Shearlet transform and transfer learning is proposed. Since, a large percentage of handwritten signatures are composed of curves and the performance of a sig...

متن کامل

Learning to Verify Systems

Making high quality and reliable software systems remains a difficult problem. One approach to address this problem is automated verification which attempts to demonstrate algorithmically that a software system meets its specification. However, verification of software systems is not easy: such systems are often modeled using abstractions of infinite structures such as unbounded integers, infin...

متن کامل

Abstract compilation of object-oriented languages into coinductive CLP(X): when type inference meets verification

compilation of object-oriented languages into coinductive CLP(X): when type inference meets verification Davide Ancona, Andrea Corradi, Giovanni Lagorio, and Ferruccio Damiani 1 DISI, University of Genova, Italy {davide,lagorio}@disi.unige.it,[email protected] 2 Dipartimento di Informatica, University of Torino, Italy

متن کامل

Challenges and Solutions of Cyber-Physical Systems

Cyber physical systems(CPS) include a lot of high complexity computing such as dynamic analysis and verification of continuous dynamic property , analysis and verification of real-time property, analysis and verification of spatial property, scheduling and fault tolerance. The correctness of computing results of cyber physical systems not only meets the time requirements, but also meets the spa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006